Practical fixed length Lempel–Ziv coding

Practical Fixed Length Lempel Ziv Coding

We explore the possibility of transforming the standard encodings of the main LZ methods to be of fixed length, without reverting to the originally suggested encodings. This has the advantage of allowing easier processing and giving more robustness against errors, while only marginally reducing the compression efficiency in certain cases.

Practical Length-limited Coding for Large Alphabets

The use of Huuman coding for economical representation of a stream of symbols drawn from a deened source alphabet is widely known. In this paper we consider the problems encountered when Huuman coding is applied to an alphabet containing millions of symbols. Conventional tree-based methods for generating the set of codewords require large amounts of main memory; and worse, the codewords generat...

Fixed Length Coding by Nonuniform Scalar Quantization in JPEG 2000

A Fixed-Length Coding Algorithm for DNA Sequence Compression

Summary: While achieving a compression ratio of 2.0 bits/base ,the new algorithm codes non-N bases1 in fixed length.It dramatically reduces the time of coding and decoding than previous DNA compression algorithms and some universal compression programs. Availability: http://grandlab.cer.net/topic.php?TopicID=50 Contact: [email protected] [email protected] [email protected]

Exponents of quantum fixed-length pure state source coding

We derive the optimal exponent of the error probability of the quantum fixedlength pure state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Josza et al. (PRL, 81, 1714 (1998))’s universal code. In the converse part, Nielsen and Kempe (PRL, 86, 5184 (2001))’s lemma is essential. In the direct part, a group representation theoretic...